Molecular graphs of a finite points set: a generalization of the Delaunay triangulation
نویسنده
چکیده
The Delaunay triangulation is generated from a points set and a structuring element of type disc. In the Delaunay triangulation definition, replacing the disc by a planar-connected region (we call a molecule), which is a union of a fixed number of discs, allows construction of what we name the molecular graphs. In a finite points set, the molecular graphs record the empty regions which are identical to the molecule, independently of translation, rotation and scaling transforms. The molecular graphs are applied to pattern recognition problem. Knowing a template (an input pattern represented by a molecule), the addressed problem is to identify the existing patterns, whose shapes are similar to the template, in a given input points set. The proposed solution is based on a generalization of the αshapes ; the disc of radius α in the ordinary α-shape is replaced, in the generalized version, by a template of size depending on α.
منابع مشابه
Adaptive Unstructured Grid Generation Scheme for Solution of the Heat Equation
An adaptive unstructured grid generation scheme is introduced to use finite volume (FV) and finite element (FE) formulation to solve the heat equation with singular boundary conditions. Regular grids could not acheive accurate solution to this problem. The grid generation scheme uses an optimal time complexity frontal method for the automatic generation and delaunay triangulation of the grid po...
متن کاملDushnik-Miller dimension of TD-Delaunay complexes
TD-Delaunay graphs, where TD stands for triangular distance, is a variation of the classical Delaunay triangulations obtained from a specific convex distance function [5]. In [2] the authors noticed that every triangulation is the TD-Delaunay graph of a set of points in R, and conversely every TD-Delaunay graph is planar. It seems natural to study the generalization of this property in higher d...
متن کاملOn shape Delaunay tessellations
Shape Delaunay tessellations are a generalization of the classical Delaunay triangulation of a finite set of points in the plane, where the empty circle condition is replaced by emptiness of an arbitrary convex compact shape. We present some new and basic properties of shape Delaunay tessellations, concerning flipping, subgraph structures, and recognition.
متن کاملConstruction of the segment Delaunay triangulation by a flip algorithm (Construction de la triangulation de Delaunay de segments par un algorithme de flip)
Given a set S of points in the plane, a triangulation of S is a partition of the convex hull of S into triangles whose vertices are the points of S. A triangulation of S is said to be Delaunay if no point of S lies inside the triangles’ circumcircles. In this thesis, we study a generalization of these notions to a set S of disjoint segments in the plane. At first, we define a new family of diag...
متن کاملThe Stretch Factor of the Delaunay Triangulation Is Less than 1.998
Let S be a finite set of points in the Euclidean plane. Let D be a Delaunay triangulation of S. The stretch factor (also known as dilation or spanning ratio) of D is the maximum ratio, among all points p and q in S, of the shortest path distance from p to q in D over the Euclidean distance ||pq||. Proving a tight bound on the stretch factor of the Delaunay triangulation has been a long standing...
متن کامل